#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL dp[maxn][12];
LL ans[maxn];
void pre(){
    dp[0][0]=1;
    ans[0]=1;
    for(LL i=1;i<maxn;i++){
        for(LL j=0;j<=9;j++){
            if(j==0){
                dp[i][j]=(dp[i-1][9]%mod);
            }
            else if(j==1){
                dp[i][j]=(dp[i-1][9]%mod+dp[i-1][0]%mod)%mod;
            }
            else{
                dp[i][j]=(dp[i-1][j-1]%mod);
            }
            ans[i]=(ans[i]%mod+dp[i][j]%mod)%mod;
        }
    }
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   pre();
   LL t;cin>>t;
   while(t--){
      LL n,m;cin>>n>>m;
      LL res=0;
      while(n){
          res=(res%mod+ans[n%10+m]%mod)%mod;
          n/=10;
      }
      cout<<res<<"\n";
   }
   return 0;
}
